package buke;

import java.util.Scanner;

public class E {
	   public int uniquePathsWithObstacles(int[][] obstacleGrid) {
		   int m = obstacleGrid.length;
		   int n = obstacleGrid[0].length;
		   int [][] a = new int [m][n];
		   if(obstacleGrid[0][0]==0) {
			   a[0][0] = 1;
		  
		  
		   for(int i=0;i<=m;i++) {
			   for(int j = 0;j<=n;j++) {
				   if(obstacleGrid[i][j]==1) {
					   a[i][j]=0;
					   continue;
				   }
				   if(i!=0||j!=0) {
				   a[i][j] = a[i-1][j]+a[i][j-1];
				   }
			   }
		   }
		   
		  
		   } return a[obstacleGrid.length][obstacleGrid[0].length];
}
public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int x = sc.nextInt();
	int y= sc.nextInt();
	int z=sc.nextInt();
	
}	   
}